On a reduction theorem for finite, bipartite 2-arc-transitive graphs
نویسنده
چکیده
Let r be a finite connecied regular bipartite 2-arc transitive graph. It is shown that r is a cover of a possibly smaller graph :E, which is also connecied and regular of the same valency as r, and there is a subgroup G of Aut :E such that G is 2-arc transitive on :E and every nontrivial normal subgroup of G has at most two orbits on vertices. Such graphs :E for which the subgroup G has an abelian normal subgroup with two orbits are investigated. It is shown that :E is a 2-arc transitive Cayley graph for either (a) an elementary abelian 2-group, or (b) a group < N, T >, where N is an elementary abelian group of odd order and T, an element of order 2, inverts every element of N. The graphs :E arising in (a) have been classified recently by A.A. Ivanov and the author.
منابع مشابه
An O'nan-scott Theorem for Finite Quasiprimitive Permutation Groups and an Application to 2-arc Transitive Graphs
A permutation group is said to be quasiprimitive if each of its nontrivial normal subgroups is transitive. A structure theorem for finite quasiprimitive permutation groups is proved, along the lines of the O'NanScott Theorem for finite primitive permutation groups. It is shown that every finite, non-bipartite, 2-arc transitive graph is a cover of a quasiprimitive 2-arc transitive graph. The str...
متن کاملTwo-geodesic transitive graphs of prime power order
In a non-complete graph $Gamma$, a vertex triple $(u,v,w)$ with $v$ adjacent to both $u$ and $w$ is called a $2$-geodesic if $uneq w$ and $u,w$ are not adjacent. The graph $Gamma$ is said to be $2$-geodesic transitive if its automorphism group is transitive on arcs, and also on 2-geodesics. We first produce a reduction theorem for the family of $2$-geodesic transitive graphs of prime power or...
متن کاملCountable locally 2-arc-transitive bipartite graphs
We present an order-theoretic approach to the study of countably infinite locally 2-arc-transitive bipartite graphs. Our approach is motivated by techniques developed by Warren and others during the study of cycle-free partial orders. We give several new families of previously unknown countably infinite locally-2-arc-transitive graphs, each family containing continuum many members. These exampl...
متن کاملFINITE s-ARC TRANSITIVE GRAPHS OF PRIME-POWER ORDER
An s-arc in a graph is a vertex sequence (α0, α1, . . . , αs) such that {αi−1, αi} ∈ EΓ for 1 6 i 6 s and αi−1 6= αi+1 for 1 6 i 6 s− 1. This paper gives a characterization of a class of s-transitive graphs; that is, graphs for which the automorphism group is transitive on s-arcs but not on (s+ 1)-arcs. It is proved that if Γ is a finite connected s-transitive graph (where s > 2) of order a p-p...
متن کاملHighly arc-transitive digraphs – counterexamples and structure∗
We resolve two problems of [Cameron, Praeger, and Wormald – Infinite highly arc transitive digraphs and universal covering digraphs, Combinatorica 1993]. First, we construct a locally finite highly arc-transitive digraph with universal reachability relation. Second, we provide constructions of 2-ended highly arc transitive digraphs where each ‘building block’ is a finite bipartite graph that is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 7 شماره
صفحات -
تاریخ انتشار 1993